public class BinarySearch {
    public static void search(int[]array,int key){
        int left =0;
        int right = array.length-1;
        while (left<=right){
            int mid =(left + right) >>>1;
            if(array[mid]<key) {
                left = mid +1;
            }else if(array[mid]>key){

            }
        }
    }
    public static void main(String[] args) {

    }
}